Grid Multiscroll Hyperchaotic Attractors Based on Colpitts Oscillator Mode with Controllable Grid Gradient and Scroll Numbers
نویسندگان
چکیده
منابع مشابه
Grid Multiscroll Hyperchaotic Attractors Based on Colpitts Oscillator Mode with Controllable Grid Gradient and Scroll Numbers
Through introducing two piecewise-linear triangular wave functions in a three-dimensional spiral chaotic Colpitts oscillator model, a four-dimensional grid multiscroll hyperchaotic system is constructed. Interestingly, by adjusting a build-in parameter in a variable of one triangle wave function, the control of the gradient of the multiscroll grid is achieved. Whereas by deploying the zero poin...
متن کاملFamilies of scroll Grid attractors
In this paper a new family of scroll grid attractors is presented. These families are classified into three called 1D-, 2Dand 3D-grid scroll attractors depending on the location of the equilibrium points in state space. The scrolls generated from 1D-, 2Dand 3D-grid scroll attractors are located around the equilibrium points on a line, on a plane or in 3D, respectively. Due to the generalization...
متن کاملControlling Hyperchaotic n×m-Scroll Attractors
Over the past decade, the fundamental issue of generating complex attractors has raised a lot of interests. One of the major classes of complex attractors is the socalled hyperchaos, which has more than one positive Lyapunov exponent, meaning that the dynamics of such a system expand in more than one direction therefore a more complex attractor can be obtained. Due to its great potential in tec...
متن کاملA family of n-scroll hyperchaotic attractors and their realization
A systematic circuit design approach is proposed for experimental verification of hyperchaotic 2-, 3-, 4-scroll attractors from a generalized Matsumoto–Chua–Kobayashi (MCK) circuit. Moreover, using appropriate discrete and extended transformations, a novel digital signal processor (DSP) method is also presented for physically realizing the above hyperchaotic 2-, 3-, 4-scroll attractors. This is...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Research and Technology
سال: 2013
ISSN: 1665-6423
DOI: 10.1016/s1665-6423(13)71547-5